Combination Weighting Method Based on Maximizing Deviations and Normalized Constraint Condition
نویسندگان
چکیده
منابع مشابه
Combination Weighting Method Based on Maximizing Deviations and Normalized Constraint Condition
When the weight of each attribute is determined in the multiple attribute decision making problems, calculated by the method of subjective values or objective values solely will cause the problem that weight coefficient is not reasonable. So the paper puts forward the weightingmethod which is based on maximizing deviations and normalized constraint condition. The method integrates the subjectiv...
متن کاملParallel feature generation based on maximizing normalized acoustic likelihood
Combining information from parallel feature streams generally improves speech recognition accuracy. While many studies have attempted to determine the stage of the recognition system that provides best combination performance and the specific nature of how features are combined, relatively little attention has been paid to the design or selection of parallel feature sets when used in combinatio...
متن کاملSelf-normalized Moderate Deviations and Lils
Let fXn;n 1g be i.i.d. R d-valued random variables. We prove Partial Moderate Deviation Principles for self-normalized partial sums subject to minimal moment assumptions. Applications to the self-normalized law of the iterated logarithm are also discussed.
متن کاملContext-Tree Weighting and Maximizing: Processing Betas
The context-tree weighting method (Willems, Shtarkov, and Tjalkens [1995]) is a sequential universal source coding method that achieves the Rissanen lower bound [1984] for tree sources. The same authors also proposed context-tree maximizing, a two-pass version of the context-tree weighting method [1993]. Later Willems and Tjalkens [1998] described a method based on ratios (betas) of sequence pr...
متن کاملDynamic Constraint Weighting for
Many real-world constraint satisfaction problems (CSPs) can be over-constrained but contain a set of mandatory or hard constraints that have to be satisfied for a solution to be acceptable. Recent research has shown that constraint weighting local search algorithms can be very effective in solving a variety of CSPs. However, little work has been done in applying such algorithms to over-constrai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Security and Its Applications
سال: 2016
ISSN: 1738-9976,1738-9976
DOI: 10.14257/ijsia.2016.10.2.04